Counting Ordered Patterns in Words Generated by Morphisms
نویسندگان
چکیده
We start a general study of counting the number of occurrences of ordered patterns in words generated by morphisms. We consider certain patterns with gaps (classical patterns) and those with no gaps (consecutive patterns). Occurrences of the patterns are known, in the literature, as rises, descents, (non-)inversions, squares and p-repetitions. We give recurrence formulas in the general case, then deducing exact formulas for particular families of morphisms. Many (classical or new) examples are given illustrating the techniques and showing their interest.
منابع مشابه
Counting ordered patterns in words generated by morphisms I. Rises, descents, and repetitions with gaps
We start a general study of counting the number of occurrences of ordered patterns in words generated by morphisms. The case of rises and descents is considered. We give recurrence formulas in the general case. We deduce exact formulas for a particular family of morphisms.
متن کاملA classification of hull operators in archimedean lattice-ordered groups with unit
The category, or class of algebras, in the title is denoted by $bf W$. A hull operator (ho) in $bf W$ is a reflection in the category consisting of $bf W$ objects with only essential embeddings as morphisms. The proper class of all of these is $bf hoW$. The bounded monocoreflection in $bf W$ is denoted $B$. We classify the ho's by their interaction with $B$ as follows. A ``word'' is a function ...
متن کاملThe equality problem for infinite words generated by primitive morphisms
We study the equality problem for infinite words obtained by iterating morphisms. In particular, we give a practical algorithm to decide whether or not two words generated by primitive morphisms are equal.
متن کاملToeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms (Extended Abstract)
We consider so-called Toeplitz words which can be viewed as generalizations of one-way innnite periodic words. We compute their subword complexity, and show that they can always be generated by iterating periodically a nite number of morphisms. Moreover, we deene a structural classiication of Toeplitz words which is reeected in the way how they can be generated by iterated morphisms.
متن کاملCounting Words by Number of Occurrences of Some Patterns
We give asymptotic expressions for the number of words containing a given number of occurrences of a pattern for two families of patterns with two parameters each. One is the family of classical patterns in the form 22 · · · 212 · · · 22 and the other is a family of partially ordered patterns. The asymptotic expressions are in terms of the number of solutions to an equation, and for one subfami...
متن کامل